#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll n;
ll r[N];
ll flag[N];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>r[i];
    sort(r+1,r+1+n);
    memset(flag,1,sizeof(flag));
    int cnt=1;
    int minn=0;
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        minn=r[cnt];
        if(flag[i]&&r[i]>minn&&i!=cnt)
            {
                ans++;
                flag[i]=0;
                flag[cnt]=0;
                cnt++;
            }
    }
    cout<<n-ans<<endl;   
    return 0;
}